A Unified Framework for DPLL(T) + Certificates
نویسندگان
چکیده
1 Tsinghua National Laboratory for Information Science and Technology (TNList), Beijing 100084, China 2 School of Software, Tsinghua University, Beijing 100084, China 3 Key Laboratory for Information System Security, MOE, Beijing 100084, China 4Department of Computer Science and Technologies, Tsinghua University, Beijing 100084, China 5 Institute of Information Science, Academia Sinica, Taipei 115, Taiwan
منابع مشابه
ADS: a unified computational framework for some consistency and abductive based propositional reasoning
This paper introduces a tool, ADS (“ArounD SAT”), based on the unified framework of “P-restricted implicant”, that can be used for some consistency and abductive reasoning. The idea behind this tool is that many types of different propositional reasoning can be expressed in terms of “‘P-restricted implicant”, the restriction of an implicant to a given set of literals, P . By providing one way t...
متن کاملAbstract DPLL and Abstract DPLL Modulo Theories
DPLL and Abstract DPLL Modulo TheoriesDPLL Modulo Theories Robert Nieuwenhuis, Albert Oliveras, and Cesare Tinelli ?? Abstract. We introduce Abstract DPLL, a general and simple abstract We introduce Abstract DPLL, a general and simple abstract rule-based formulation of the Davis-Putnam-Logemann-Loveland (DPLL) procedure. Its properties, such as soundness, completeness or termination, immediatel...
متن کاملIntegrating Simplex with DPLL ( T )
We present a new Simplex-based linear arithmetic solver that can be integrated efficiently in the DPLL(T ) framework. The new solver improves over existing approaches by enabling fast backtracking, supporting a priori simplification to reduce the problem size, and providing an efficient form of theory propagation. We also present a new and simple approach for solving strict inequalities. Experi...
متن کاملAn SMT Algorithm for Direct Model Search: Implementation and Experimentation
SMT solvers have traditionally been based on the DPLL(T) algorithm, where the driving force behind the procedure is a DPLL search over truth valuations. This traditional framework allows for a degree of modularity in the treatment of theory solvers. Over time, theory solvers have become more and more closely integrated into the DPLL process, and consequently less and less modular. In this paper...
متن کاملAutomated Reasoning Techniques as Proof-search in Sequent Calculus. (Techniques de déduction automatique vues comme recherche de preuve en calcul des séquents)
This thesis designs a theoretical and general framework where proof-search can modularly interact with domain-specific procedure(s). This framework is a focussed sequent calculus for polarised classical logic, with quantifiers, and it is designed in the view of capturing various computer-aided reasoning techniques that exist in logic programing, goal-directed systems, proof-assistants, and auto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Applied Mathematics
دوره 2013 شماره
صفحات -
تاریخ انتشار 2013